Lowness for Kurtz randomness

نویسندگان

  • Noam Greenberg
  • Joseph S. Miller
چکیده

We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu [16], this proves that they coincide with the hyperimmune-free non-DNR degrees, which are also exactly the degrees that are low for weak 1-genericity. We also consider Low(M, Kurtz), the class of degrees a such that every element of M is a-Kurtz random. These are characterised when M is the class of Martin-Löf random, computably random, or Schnorr random reals. We show that Low(ML, Kurtz) coincides with the non-DNR degrees, while both Low(CR, Kurtz) and Low(Schnorr, Kurtz) are exactly the non-high, nonDNR degrees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lowness for uniform Kurtz randomness

We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. One advantage of this notion is that lowness for uniform Kurtz randomness has many characterizations, such as those via complexity, martingales, Kurtz tt-traceability, and Kurtz dimensional measure.

متن کامل

Uniform Kurtz randomness

We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. This notion has more natural properties than the usual relativization. For instance, van Lambalgen’s theorem holds for uniform Kurtz randomness while not for (the usual relativization of) Kurtz randomness. Another advantage is that lowness for uniform Kurtz randomness has many characterization...

متن کامل

Higher Kurtz randomness

A real x is ∆1-Kurtz random (Π 1 1-Kurtz random) if it is in no closed null ∆1 set (Π 1 1 set). We show that there is a cone of Π 1 1-Kurtz random hyperdegrees. We characterize lowness for ∆1-Kurtz randomness as being ∆ 1 1-dominated and ∆ 1 1semi-traceable.

متن کامل

Lowness and Π 02

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.

متن کامل

Lowness and Π2 Nullsets

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.

متن کامل

Null-additivity in the Theory of Algorithmic Randomness

In this paper, we develop a general framework integrating algorithmic and higher randomness theories. We clarify the relationship of the notions of triviality and uniform-lowness in algorithmic randomness theory and null-additivity in set theory by effectivizing combinatorial characterizations of transitive additivity in set theory of the real line. For instance, we show that the following thre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2009